Characteristic exponents and diagonally dominant linear differential systems
نویسندگان
چکیده
منابع مشابه
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time
We present a linear-system solver that, given an -bysymmetric positive semi-definite, diagonally dominant matrix with non-zero entries and an -vector , produces a vector within relative distance of the solution to in time ! #"%$'&( ) +*, !-/.!0213 546, where . is the log of the ratio of the largest to smallest non-zero entry of . If the graph of has genus 87 9 or does not have a :<;>= minor, th...
متن کاملParallel Solution of Narrow Banded Diagonally Dominant Linear Systems
Abstract ScaLAPACK contains a pair of routines for solving systems which are narrow banded and diagonally dominant by rows. Mathematically, the algorithm is block cyclic reduction. The ScaLAPACK implementation can be improved using incomplete, rather than complete block cyclic reduction. If the matrix is strictly dominant by rows, then the truncation error can be bounded directly in terms of th...
متن کاملSolving Symmetric Diagonally-Dominant Systems by Preconditioning
In this paper we design support-tree preconditioners for n × n matrices with m nonzeros that aresymmetric and diagonally-dominant with a nonnegative diagonal (SDD matrix). This reduces to de-signing such a preconditioner for a Laplacian matrix, A, which can be interpreted as an undirectednonnegatively-weighted graph, G with n vertices and m edges. Preconditioners accelerate the ...
متن کاملNearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
We present a randomized algorithm that, on input a weakly diagonally dominant symmetric n-by-n matrix A with m non-zero entries and an n-vector b, produces an x̃ such that ‖x − x̃‖ A ≤ ǫ ‖x‖ A , where Ax = b, in expected time m log n log(1/ǫ). The algorithm applies subgraph preconditioners in a recursive fashion. These preconditioners improve upon the subgraph preconditioners first introduced by ...
متن کاملA Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems II
We continue the comparison of parallel algorithms for solving diagonally dominant and general narrow-banded linear systems of equations that we started in [2]. The solvers compared are the banded system solvers of ScaLAPACK [6] and those investigated by Arbenz and Hegland [1, 5]. We present the numerical experiments that we conducted on the IBM SP/2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1971
ISSN: 0022-247X
DOI: 10.1016/0022-247x(71)90246-0